Graph partitions and the controllability of directed signed networks
نویسندگان
چکیده
منابع مشابه
k-optimal Partitions of a Directed Graph
A partition M is k-optimal if M minimizes BdM). For instance, if G has a Hamiltonian path J.Lo, then M = W.o} is a k -optimal partition. So the k -optimal partitions extend in some sense the concept of Hamiltonian paths. The theorem of Greene and Kleitman [10], which extends the Dilworth theorem [5], shows an important property of k-optimal partitions for the graph of a partially ordered set (i...
متن کاملthe effects of cooperative versus individual directed reading thinking activities on students inferential and referential questions
two groups of students were assigned as experimental and control ones, and were given instruction on directed reading-thinking activities and after some treatment, they were post-tested. although the initial pre-test did not show any significant differences, the final post-test result revealed that the cooperative reading comprehension helped the experimental group. the cooperative students’...
15 صفحه اولThe H - Line Signed Graph of a Signed Graph
A Smarandachely k-signed graph (Smarandachely k-marked graph) is an ordered pair S = (G,σ) (S = (G,μ)) where G = (V, E) is a graph called underlying graph of S and σ : E → (e1, e2, ..., ek) (μ : V → (e1, e2, ..., ek)) is a function, where each ei ∈ {+,−}. Particularly, a Smarandachely 2-signed graph or Smarandachely 2-marked graph is called abbreviated a signed graph or a marked graph. Given a ...
متن کاملDirected prime graph of non-commutative ring
Prime graph of a ring R is a graph whose vertex set is the whole set R any any two elements $x$ and $y$ of $R$ are adjacent in the graph if and only if $xRy = 0$ or $yRx = 0$. Prime graph of a ring is denoted by $PG(R)$. Directed prime graphs for non-commutative rings and connectivity in the graph are studied in the present paper. The diameter and girth of this graph are also studied in the pa...
متن کاملThe 90/10 phenomenon in directed signed social networks
We empirical study the signs’ property in the directed signed social networks of Slashdot and Epinions by using an reshuffled approach. Through calculating the entropy Sout and the giant component G, we find an interesting 90/10 phenomenon: each individual labels his/her neighbors as friends with 90% or foes with 10% uniformly random from the macroscopic perspective. We also find that the entro...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Science China Information Sciences
سال: 2019
ISSN: 1674-733X,1869-1919
DOI: 10.1007/s11432-018-9450-8